Stochastic Bounds on Delays of Fair Queueing Algorithms

In this paper we study the delay characteristics of Fair Queueing algorithms with a stochastic comparison approach. In integrated services networks, Fair Queueing (FQ) algorithms have received much attention, because they can guarantee an end-to-end session delay bound when the burstiness of the session traac is bounded, and they ensure the fair allocation of the bandwidth. The delay characteristics of these algorithms are evaluated only in the case of bounded burstiness by considering the worst-case. We derive the stochastic bounds on the delay distribution for a bursty traac under a Smallest Finishing First (SFF) FQ policy. In fact, we evaluate two modiied Weighted Round Robin (WRR) policies, which are easier to model, in order to provide stochastic bounds for a FQ policy.